On the Performance of the Relay-ARQ Networks

This paper investigates the performance of relay networks in the presence of hybrid automatic repeat request (ARQ) feedback and adaptive power allocation. The throughput and the outage probability of different hybrid ARQ protocols are studied for independent and spatially-correlated fading channels. The results are obtained for the cases where there is a sum power constraint on the source and the relay or when each of the source and the relay are power-limited individually. With adaptive power allocation, the results demonstrate the efficiency of relay-ARQ techniques in different conditions.Comment: Accepted for publication in IEEE Trans. Veh. Technol. 201

Green communication via Type-I ARQ: Finite block-length analysis

This paper studies the effect of optimal power allocation on the performance of communication systems utilizing automatic repeat request (ARQ). Considering Type-I ARQ, the problem is cast as the minimization of the outage probability subject to an average power constraint. The analysis is based on some recent results on the achievable rates of finite-length codes and we investigate the effect of codewords length on the performance of ARQ-based systems. We show that the performance of ARQ protocols is (almost) insensitive to the length of the codewords, for codewords of length $\ge 50$ channel uses. Also, optimal power allocation improves the power efficiency of the ARQ-based systems substantially. For instance, consider a Rayleigh fading channel, codewords of rate 1 nats-per-channel-use and outage probability $10^{-3}.$ Then, with a maximum of 2 and 3 transmissions, the implementation of power-adaptive ARQ reduces the average power, compared to the open-loop communication setup, by 17 and 23 dB, respectively, a result which is (almost) independent of the codewords length. Also, optimal power allocation increases the diversity gain of the ARQ protocols considerably.Comment: Accepted for publication in GLOBECOM 201

A Genetic Algorithm-based Beamforming Approach for Delay-constrained Networks

In this paper, we study the performance of initial access beamforming schemes in the cases with large but finite number of transmit antennas and users. Particularly, we develop an efficient beamforming scheme using genetic algorithms. Moreover, taking the millimeter wave communication characteristics and different metrics into account, we investigate the effect of various parameters such as number of antennas/receivers, beamforming resolution as well as hardware impairments on the system performance. As shown, our proposed algorithm is generic in the sense that it can be effectively applied with different channel models, metrics and beamforming methods. Also, our results indicate that the proposed scheme can reach (almost) the same end-to-end throughput as the exhaustive search-based optimal approach with considerably less implementation complexity

Reinforcement-based data transmission in temporally-correlated fading channels: Partial CSIT scenario

Reinforcement algorithms refer to the schemes where the results of the previous trials and a reward-punishment rule are used for parameter setting in the next steps. In this paper, we use the concept of reinforcement algorithms to develop different data transmission models in wireless networks. Considering temporally-correlated fading channels, the results are presented for the cases with partial channel state information at the transmitter (CSIT). As demonstrated, the implementation of reinforcement algorithms improves the performance of communication setups remarkably, with the same feedback load/complexity as in the state-of-the-art schemes.Comment: Accepted for publication in ISWCS 201

On the Performance of Millimeter Wave-based RF-FSO Links with HARQ Feedback

This paper studies the performance of hybrid radio-frequency (RF) and free-space optical (FSO) links in the cases with and without hybrid automatic repeat request (HARQ). Considering millimeter wave (mmwave) characteristics in the RF link and pointing errors in the FSO link, we derive closed-form expressions for the message decoding probabilities as well as the throughput and the outage probability of the RF-FSO setups. We also evaluate the effect of various parameters such as power amplifiers efficiency, different transmission techniques in the FSO link, pointing errors in the FSO link as well as different coherence times/symbol rates of the RF and the FSO links on the throughput and outage probability. The results show the efficiency of the RF-FSO links in different conditions. Moreover, the HARQ can effectively improve the outage probability/energy efficiency, and compensate the effect of hardware impairments in RF-FSO links.Comment: Under review in PIMRC'201

On the Throughput of Large-but-Finite MIMO Networks using Schedulers

This paper studies the sum throughput of the {multi-user} multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users' data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effect of different parameters, such as channel/precoding models, number of antennas/users, scheduling costs and power amplifiers' efficiency, on the system performance. Finally, we use the recent results on the achievable rates of finite block-length codes to analyze the system performance in the cases with short packets. As demonstrated, the proposed GA-based scheduler reaches (almost) the same throughput as in the exhaustive search-based optimal scheduler, with substantially less implementation complexity. Moreover, the power amplifiers' inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly

On the Ergodic Achievable Rates of Spectrum Sharing Networks with Finite Backlogged Primary Users and an Interference Indicator Signal

Spectrum sharing networks are communication setups in which unlicensed secondary users (SUs) are permitted to work within the spectrum resources of licensed primary users (PUs). This paper aims to study the ergodic achievable rates of spectrum sharing networks with finite backlogged primary user and an interference indicator signal. Here, in contrast to the standard interference-avoiding schemes, the secondary user activity is not restricted within the primary user inactive periods. Considering both fading and nonfading channels, the unlicensed user ergodic achievable rate is obtained for different unlicensed user transmission power and licensed user received interference power or signal-to-interference-and-noise (SINR) constraints. In the case of fading channels, the results are obtained for both short-and long-term primary user quality-of-service requirements. Further, the results are generalized to the case of multiple interfering users. In terms of unlicensed user ergodic achievable rate, analytical results indicate that while the standard interference-avoiding approach is the optimal transmission scheme at low secondary user or high primary user transmission powers, higher rates can be achieved via simultaneous transmission at high secondary user SINRs. Moreover, numerical results show that, using an interference indicator signal, there is considerable potential for data transmission of unlicensed users under different licensed users quality-of-service requirements

Interference management using one bit feedback

This paper studies the performance of quasi-static spectrum sharing networks utilizing one bit interference indicator feedback. Assuming no channel state information at the transmitters, the channel average rate is obtained under different power allocation strategies. Simulation results show that interference indicator feedback leads to considerable rate increment even with no transmitter channel state information

Feedback Subsampling in Temporally-Correlated Slowly-Fading Channels using Quantized CSI

This paper studies the problem of feedback subsampling in temporally-correlated wireless networks utilizing quantized channel state information (CSI). Under both peak and average power constraints, the system data transmission efficiency is studied in two scenarios. First, we focus on the case where the codewords span one fading block. In the second scenario, the throughput is determined for piecewise slowly-fading channels where the codewords are so long that a finite number of correlated gain realizations are experienced during each codeword transmission. Considering different temporal correlation conditions in both scenarios, substantial throughput increment is observed with feedback rates well below 1 bit per slot